A Fusion Crossover Mutation Sparrow Search Algorithm
نویسندگان
چکیده
Aiming at the inherent problems of swarm intelligence algorithm, such as falling into local extremum in early stage and low precision later stage, this paper proposes an improved sparrow search algorithm (ISSA). Firstly, we introduce idea flight behavior bird SSA to keep diversity population reduce probability optimum; Secondly, creatively crossover mutation genetic get better next-generation population. These two improvements not only all times but also make up for defect that is easy fall optimum end iteration. The optimization ability greatly improved.
منابع مشابه
A Fusion of Crossover and Local Search
It is well known that GAs are not well suited for fine-tuning structures that are very close to optimal solutions and that it is essential to incorporate local search methods, such as neighborhood search, into GAs. This paper explores the use of a new GA operator called multi-step crossover fusion (MSXF), which combines a crossover operator with a neighborhood search algorithm. MSXF performs a ...
متن کاملA quantum genetic algorithm with quantum crossover and mutation operations
In the context of evolutionary quantum computing in the literal meaning, a quantum crossover operation has not been introduced so far. Here, we introduce a novel quantum genetic algorithm which has a quantum crossover procedure performing crossovers among all chromosomes in parallel for each generation. A complexity analysis shows that a quadratic speedup is achieved over its classical counterp...
متن کاملArtificial Bee Colony (ABC) Algorithm with Crossover and Mutation
Artificial bee colony (ABC) is a relatively new swarm intelligence based metaheuristic. It was successfully applied to various, mostly continuous, optimization problems. For all such heuristically guided search algorithms balance between exploitation and exploration is the determining factor for success. It is generally considered that in the ABC algorithm exploitation is performed by employed ...
متن کاملCrossover and Mutation Operations in GA-Genetic Algorithm
Genetic Algorithms GA are search algorithms based on the principles of natural selection and genetics. GA evolves a population of initial individuals to a population of high quality individuals, where each individual represents a solution to the problem to be solved. Each individual is called chromosome and is composed of predetermined number of genes. The quality of each rule is measured by a ...
متن کاملAdaptive Genetic Algorithm with Mutation and Crossover Matrices
A matrix formulation for an adaptive genetic algorithm is developed using mutation matrix and crossover matrix. Selection, mutation, and crossover are all parameter-free in the sense that the problem at a particular stage of evolution will choose the parameters automatically. This time dependent selection process was first developed in MOGA (mutation only genetic algorithm) [Szeto and Zhang, 20...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2021
ISSN: ['1026-7077', '1563-5147', '1024-123X']
DOI: https://doi.org/10.1155/2021/9952606